package com.vint.lintcode;

import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;

/**
 * 一组非负整数，求拼接成的最大数
 */
public class Lintcode184 {
	public String largestNumber(int[] nums) {
		if(null == null) {
			return null;
		}
		//Collections.sort(nums, new IntCompara());
		return null;
	}
	class IntCompara implements Comparator<Integer>{
		@Override
		public int compare(Integer a, Integer b) {
			return 1;
		}

	}

	public static void main(String[] args) {
	}
}
